Communicability and geometry of complex networks
نویسنده
چکیده
I will introduce some basic concepts of network theory, in particular the small-worldness and how the communication is though to flow in networks. Then, I will motivate and introduce the concept of communicability. I will show the way to formulate this concept mathematically. I will show a few applications of this concept in different areas, such as material sciences, human brain diseases and bioinformatics. Then, I will introduce the concept of communicability distance and angles, and will show how them induces the embedding of a network in a high-dimensional Euclidean space. Using these concepts I will show how to investigate the spatial efficiency of networks and will illustrate the analysis of urban street networks, brain networks, protein residue networks and others.
منابع مشابه
The Physics of Communicability in Complex Networks
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that commu...
متن کاملCommunicability in complex networks.
We propose a new measure of the communicability of a complex network, which is a broad generalization of the concept of the shortest path. According to the new measure, most of the real-world networks display the largest communicability between the most connected (popular) nodes of the network (assortative communicability). There are also several networks with the disassortative communicability...
متن کاملComplex networks in the Euclidean space of communicability distances.
We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded rou...
متن کاملCommunicability Graph and Community Structures in Complex Networks
We use the concept of network communicability (Phys. Rev. E 77, 036111 (2008)) to define communities in a complex network. The communities are defined as the cliques of a “communicability graph”. The communicability graph is defined here as the graph having the same set of vertices as the complex network and the connections between them are determined by the communicability function. Two nodes ...
متن کاملPredicting triadic closure in networks using communicability distance functions
We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the “goodness” of communication between nodes in the network. We study 25 real-world networks and show that the proposed method predicts correctly 20% of triadic closures in these networks, in contrast...
متن کامل